On matrix-product structure of repeated-root constacyclic codes over finite fields

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix-product structure of repeated-root constacyclic codes over finite fields

For any prime number p, positive integers m, k, n satisfying gcd(p, n) = 1 and λ0 ∈ F × pm, we prove that any λ p 0 -constacyclic code of length p n over the finite field Fpm is monomially equivalent to a matrix-product code of a nested sequence of p λ0-constacyclic codes with length n over Fpm.

متن کامل

Constacyclic codes over finite fields

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length lp are characterized, where p is the characteristic of the finite field and l is a prime different from p.

متن کامل

On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields

In this paper we investigate the structure of repeated root constacyclic codes of length 2mp over Fps with a ≥ 1 and (m, p) = 1. We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes.

متن کامل

Repeated-Root Self-Dual Negacyclic Codes over Finite Fields

Let Fq be a finite field with q = p , where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2p over Fq, a ≥ 1. The construction of self-dual negacyclic codes of length 2bp over Fq is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.

متن کامل

Repeated-root constacyclic codes of length slmpn

For any different odd primes ` and p, structure of constacyclic codes of length 2`p over the finite field Fq of characteritic p and their duals is established in term of their generator polynomials. Among other results, the characterization and enumeration of all linear complimentary dual and self-dual constacylic codes of length 2`p are obtained.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2020

ISSN: 0012-365X

DOI: 10.1016/j.disc.2019.111768